Three terminals, a telefax, and one dictionary
نویسندگان
چکیده
منابع مشابه
ترجمه و تحقیق کتاب three faiths- one god a jewish,christian muslim encouter
این کتاب شامل یازده فصل می باشد که سه فصل آن که حدوداً 83 صفحه می باشد، ترجمه شده است. در فصل اول بحثی در مورد خدا آغاز می شود و این بحث تا فصل سوم ادامه دارد و هر یک از نمایندگان سه دین یهودیت، مسیحیت و اسلام خدای خود را معرفی و اوصاف و ویژگیهای او را بازگو می کنند. در فصل اول فرد یهودی در مورد واقعیت مدرن ایمان یهودی و عمل و روابط بعنوان کلیدهایی برای ایمان، کسب معرفت به خدا از طریق وحی و دع...
15 صفحه اولReversing a One - Way Bilingual Dictionary
In 1996, I completed a 10-year project to compile an Albanian-English dictionary of some 75,000 entries and sub-entries. With that project completed, I decided to prepare a companion English-Albanian dictionary, but I did not want to devote another 10 years to that compilation. Instead, I wanted to see how far purely computa tional techniques would go in converting my dictionary into its deriv...
متن کاملDictionary Matching with One Gap
The dictionary matching with gaps problem is to preprocess a dictionary D of d gapped patterns P1, . . . , Pd over alphabet Σ, where each gapped pattern Pi is a sequence of subpatterns separated by bounded sequences of don’t cares. Then, given a query text T of length n over alphabet Σ, the goal is to output all locations in T in which a pattern Pi ∈ D, 1 ≤ i ≤ d, ends. There is a renewed curre...
متن کاملFast String Dictionary Lookup with One Error
A set of strings, called a string dictionary, is a basic string data structure. The most primitive query, where one seeks the existence of a pattern in the dictionary, is called a lookup query. Approximate lookup queries, i.e., to lookup the existence of a pattern with a bounded number of errors, is a fundamental string problem. Several data structures have been proposed to do so efficiently. A...
متن کاملEdge-disjoint paths with three terminals
We prove that in every simple graph G with minimum degree d ≥ 2, there are edges {uv, vw} such that G contains b3d/2c edge-disjoint {u, v, w}-paths. If d is even, the paths can be chosen such that each pair of vertices in {u, v, w} is joined by d/2 paths. If d is odd, any specified pair of vertices in {u, v, w} can be joined by (d + 1)/2 of these paths and the other two pairs by (d − 1)/2 paths...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: College & Research Libraries News
سال: 1985
ISSN: 2150-6698,0099-0086
DOI: 10.5860/crln.46.10.536